/*
 * Saphre - Suffix Arrays for Phrase Extraction
 * Copyright (C) 2013 
 * Dale Gerdemann - Tübingen, Germany 
 * Niko Schenk - Frankfurt am Main, Germany
 * All rights reserved.
 *
 * This program is free software: you can redistribute it and/or modify it under
 * the terms of the GNU General Public License as published by the Free Software
 * Foundation, either version 3 of the License, or (at your option) any later
 * version.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
 * details.
 *
 * You should have received a copy of the GNU General Public License along with
 * this program. If not, see <http://www.gnu.org/licenses/>.
 *
 */
package util.tokenization_io;

import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
 * A special normalizer just for the "turtle corpus". NEEDS UPDATE
 */
public class DNormalize implements Normalizer {

    static Pattern pat1 = Pattern.compile("\\#\\s+");
    static Pattern pat2 = Pattern.compile("\\%\\s+");
    static Pattern pat3 = Pattern.compile("\\$\\s+");
    static Pattern pat4 = Pattern.compile("\\&\\s+");

    @Override
    public String normalize(String tok) {
        Matcher m = pat1.matcher(tok);
        if (m.matches()) {
            return "#";
        }
        m = pat2.matcher(tok);
        if (m.matches()) {
            return "%";
        }
        m = pat3.matcher(tok);
        if (m.matches()) {
            return "$";
        }
        m = pat4.matcher(tok);
        if (m.matches()) {
            return "&";
        }
        return tok;
    }
    
}
